An inequality on graph spectra
نویسندگان
چکیده
منابع مشابه
on spectra of unitary cayley mixed graph
in this paper we introduce mixed unitary cayley graph $m_{n}$ $(n>1)$ and compute its eigenvalues. we also compute the energy of $m_{n}$ for some $n$.
متن کاملRevisiting Two Classical Results on Graph Spectra
Let (G) and min (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G of order n and diameter D; then (G) (H) > 1 2D (G)n : (ii) If G is a connected nonbipartite graph of order n and diameter D, then (G) + min (G) > 2 2D (G)n : These bounds have the correct order of magnitude for large and D. ...
متن کاملA Graph Bottleneck Inequality
For a weighted directed multigraph, let fij be the total weight of spanning converging forests that have vertex i in a tree converging to j. We prove that fij fjk = fik fjj if and only if every directed path from i to k contains j (a graph bottleneck equality). Otherwise, fij fjk < fik fjj (a graph bottleneck inequality). In a companion paper [1] (P. Chebotarev, A new family of graph distances,...
متن کاملSpectra and Graph Comparison
We give some inequalities relating the number of edges that two graphs of the same order may have in common with their degree sequences and their spectra. We then give some examples and related inequalities, and present applications to independence number and coloration.
متن کاملAn inequality for the group chromatic number of a graph
We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality and discuss applications of the theorem. Keywords— Brooks’ Theorem, Group coloring, Group chromatic number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2007
ISSN: 0893-9659
DOI: 10.1016/j.aml.2005.11.031